Mathematical modeling of multiple tour multiple traveling salesman problem using evolutionary programming
نویسندگان
چکیده
منابع مشابه
An extended multiple Traveling Salesman Problem
This paper deals with the routing problem of health care sta in a home health care problem. Given a list of patients needing several cares, the problem is to assign cares to care workers. Some cares have to be performed by several persons and some cares cannot be performed with others. If a patient needs several cares, he may want to be treated by the same person. Moreover, some skills constrai...
متن کاملMathematical Programming Approaches to the Traveling Salesman Problem
The Traveling Salesman Problem or TSP is a fundamental andwell-known problem in combinatorial optimisation. At present, the mostsuccessful algorithms for solving large-scale instances of the TSP to proven(near-)optimality are based on integer programming. This entry introducesthe main theoretical and algorithmic tools involved. Topics covered include:formulations of the TSP,...
متن کاملEvolutionary Computational Approaches to Solving the Multiple Traveling Salesman Problem Using a Neighborhood Attractor Schema
This paper presents a variation of the Euclidean Traveling Salesman Problem (TSP), the Multiple Traveling Salesman Problem (MTSP), and compares a variety of evolutionary computation algorithms and paradigms for solving it. Techniques implemented, analyzed, and discussed herein with regard to MTSP include use of a neighborhood attractor schema (a variation on k-means clustering), the "shrink-wra...
متن کاملSolving the Multiple Traveling Salesman Problem by a Novel Meta-heuristic Algorithm
The multiple traveling salesman problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution. Although the MTSP is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. This paper presents an efficient and evolutionary optimization algorith...
متن کاملAn Effective Genetic Algorithm for Solving the Multiple Traveling Salesman Problem
The multiple traveling salesman problem (MTSP) involves scheduling m > 1 salesmen to visit a set of n > m nodes so that each node is visited exactly once. The objective is to minimize the total distance traveled by all the salesmen. The MTSP is an example of combinatorial optimization problems, and has a multiplicity of applications, mostly in the areas of routing and scheduling. In this paper,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 2015
ISSN: 0307-904X
DOI: 10.1016/j.apm.2014.11.043